Method and apparatus for efficient bandwidth utilization for subscriber unit initialization and synchronization in a time-synchronized communication system

ABSTRACT

A bandwidth efficient subscriber unit initialization and synchronization method and apparatus is described. The inventive subscriber unit initialization and synchronization method and apparatus uses a combination of an access burst format and a data transportation technique to efficiently use bandwidth when initializing and synchronizing subscriber units in a time-synchronized communication system. Advantageously, the present invention provides a mechanism for a base station to receive multiple access bursts from multiple subscriber units in a single contiguous time period. In the preferred embodiment of the present invention, bandwidth is efficiently utilized by searching for multiple initial access bursts from multiple mobile stations during a single time period known as a new access opportunity. The preferred embodiment of the present invention initializes and synchronizes subscriber units in a “contention-based” manner.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.12/643,324, filed Dec. 21, 2009, which is a continuation of U.S. patentapplication Ser. No. 11/513,297, filed Aug. 29, 2006 (issued as U.S.Pat. No. 7,668,152 on Feb. 23, 2010), which is a continuation of U.S.patent application Ser. No. 11/270,430, filed on Nov. 8, 2005 (issued asU.S. Pat. No. 7,860,076 on Dec. 28, 2010), which is a continuation ofU.S. patent application Ser. No. 09/629,569, filed on Jul. 31, 2000(issued as U.S. Pat. No. 6,977,919 on Dec. 20, 2005).

This application is also related to U.S. Pat. No. 6,016,311, issued Jan.18, 2000, entitled “An Adaptive Time Division Duplexing Method andApparatus for Dynamic Bandwidth Allocation within a WirelessCommunication System”, and U.S. Pat. No. 6,925,068, issued Aug. 2, 2005,entitled “Method and Apparatus for Allocating Bandwidth in a WirelessCommunication System.”

The patents and co-pending applications are hereby incorporated byreference herein for their teachings on wireless communication systems.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to communication systems, and more particularlyto a method and apparatus for efficiently using bandwidth for subscriberunit initialization and synchronization in a time-synchronizedcommunication system.

2. Description of Related Art

Time-synchronized communication systems are essential in modern society.Time-synchronized communication systems typically comprise sets ofsubscriber units or stations that communicate with one another. Thecommunication system is “time synchronized” because a set of subscriberunits is typically synchronized to a single time reference. Examples oftime-synchronized communication systems include wireless communicationsystems and cable modem systems. As described in the commonly assignedrelated U.S. Pat. No. 6,016,311, wireless communication systemsfacilitate two-way communication between a plurality of subscriber radiostations or subscriber units (fixed and portable) and a fixed networkinfrastructure. Exemplary wireless communication systems includebroadband wireless, satellite communication, mobile cellular telephonesystems, personal communication systems (PCS), and cordless telephones.The key objective of these wireless communication systems is to providecommunication channels on demand between the plurality of subscriberunits and their respective base stations in order to connect asubscriber unit user with the fixed network infrastructure (usually awire-line system). In the wireless systems having multiple accessschemes, a time “frame” is used as the basic information transmissionunit. Each frame is sub-divided into a plurality of “time slots”. Sometime slots are used for control purposes and some for informationtransfer. Subscriber units typically communicate with a selected basestation using a “duplexing” scheme thus allowing for the exchange ofinformation in both directions of connection.

Transmissions from the base station to the subscriber unit are commonlyreferred to as “downlink” transmissions. Transmissions from thesubscriber unit to the base station are commonly referred to as “uplink”transmissions. Downlink and uplink transmissions comprise “bursts” thatare defined herein as data packets utilized for transmitting informationbetween the base stations and the subscriber units. The base stationmaps and allocates bandwidth for both the uplink and downlinkcommunication links. These maps are developed and maintained by the basestation and are referred to as the Uplink Sub-frame Maps and DownlinkSub-frame Maps.

Propagation delays (i.e., time delays in transmissions between atransmitting unit and a receiving unit due to the distance or rangebetween the units) occur within most communication systems. Intime-synchronized communication systems, propagation delays must bedetermined because subscriber units are time synchronized to theirrespective base stations' time reference. Because a base stationtypically communicates with a plurality of subscriber units, the basestation assigns to each subscriber unit unique time frames for receivingtransmissions from the subscriber unit. Thus, a subscriber unit musttransmit a burst to its associated base station during a particulardesignated time frame. For a burst to arrive from the subscriber unit tothe base station “on time” (i.e., upon the occurrence of its designatedtime frame) the particular time of transmission should take into accountpropagation delays.

One example of time-synchronized communication is now described. In awireless communication system, bursts travel through the atmosphere atapproximately the speed of light (i.e., 3*10⁸ m/s). If the range betweena subscriber unit and its associated base station is 5 km, thepropagation delay is 16.67 microseconds (3.33 microseconds/km*5 km).Thus, a base station sending a message to a subscriber unit has apropagation delay of 16.67 microseconds. The subscriber unit's responseto the base station has another associated propagation delay of 16.67microseconds. Thus, the round-trip propagation delay (i.e., total delayfor a burst to travel from the base station to the subscriber unit andfor the subscriber unit to respond to the burst by sending a message tothe base station) is approximately 33.3 microseconds (16.67+16.67).Round-trip delay is also commonly referred to as “Tx time advance”. Fora subscriber unit to be time-synchronized to the base station's timereference, the subscriber unit therefore must transmit its burst 33.3microseconds early. Time-synchronization between a subscriber unit and abase station consequently depends upon knowledge of the round-trip delayor range between the subscriber unit and the base station.

Disadvantageously, problems occur during initialization processesbetween the base station and the subscriber units. Problems occur when asubscriber unit initially accesses the base station because thesubscriber unit's round-trip delay (or range) is initially unknown. Ifthe round-trip delay is unknown, a burst can arrive at a time frameassigned to a different subscriber unit and thereby cause “collisions”(i.e., bursts from different subscriber units arrive at the base stationsimultaneously). Collisions can degrade a communication system'sperformance because a base station can typically receive transmissions(i.e., bursts) from only one subscriber unit at any given moment intime. Thus, a mechanism for providing initialization and synchronizationbetween a plurality of subscriber units and their associated basestation is needed.

One method for providing initialization and synchronization between aplurality of subscriber units and base stations is known as the “RandomAccess Burst” (RAB) method and is described in detail in a book bySiegmund M. Redl, Matthias K. Weber and Malcolm W. Oliphant; entitled“An Introduction to GSM” appearing at section 5.8.2 (pages 84, 85 and95), published in 1995, and hereby incorporated by reference herein forits teachings on initialization and synchronization procedures inwireless communication systems. The RAB method described by Redl et al.takes advantage of “timing opportunities” (periods of time assigned forsubscriber unit initialization and synchronization purposes) duringwhich subscriber units that have not resolved their round-trip delay orTx time advance (i.e., not yet synchronized with the base station's timereference) may transmit without interfering with other subscriber unitsthat have already resolved their round-trip delay or Tx time advance(i.e., subscriber units that have already synchronized with the basestation's time reference). In the RAB method, a subscriber unit utilizesa “random access burst” when initially attempting to communicate withits associated base station.

FIG. 1 shows the structure of a random access burst in accordance withthe Random Access Burst method. The random access burst comprisesmessage bits (m) 2 and guard bits (g) 4. The message bits 2 containinformation regarding synchronization and identification of thesubscriber unit. The length of the message bits 2 determines a timeperiod known as the “m” time period because each bit requires a certainlength of time to transmit. The guard bits 4 provide a mechanism forpreventing collisions. The length of the guard bits 4 determines a timeperiod known as the “g” time period. The g time period represents themaximum round trip delay possible in a communication system (i.e., asituation where the subscriber unit is at a maximum distance from thebase station as determined by the base station's capabilities). Forexample, in a wireless communication system wherein the maximum distancefrom the subscriber to the base station is 37.75 km, the maximum roundtrip distance is 75.5 km (2*37.75). Thus, the maximum round trip delayis approximately 252 microseconds (75.5 km*3.33 μs/km). In the example,the length of the guard bits 4 must be a minimum of 68.25 bits becauseeach guard bit requires 3.69 microseconds to transmit (i.e., 252 μs/3.69μs/bit=68.25 bits).

The RAB method reserves various time frames in the uplink called “timingopportunities” for subscriber units that have not resolved theirround-trip delay or Tx time advance (i.e., subscriber units that havenot yet synchronized with the base station's time reference). A timingopportunity must be sufficient in duration to accommodate subscriberunits that are at the maximum range of the base station. Thus, referringto FIG. 1, the duration of the timing opportunity must be equal to atleast the time period represented by the random access burst (i.e., mtime period+g time period) in order to accommodate a subscriber unitthat is at a maximum range from the base station.

FIG. 2 shows the time sequence of a random access burst arriving at atiming opportunity in accordance with the Random Access Burst method. InFIG. 2, a timing opportunity exists at a time frame n of an UplinkSub-frame (as described in more detail below with reference to FIG. 3).As shown in FIG. 2, the timing opportunity begins at an instant in timeknown as a “Start of Opportunity” time instant and ends at an instant intime known as an “End of Opportunity” time. In accordance with the RABmethod subscriber units begin transmitting a random access burst at theStart of Opportunity time (i.e., at the beginning of a timingopportunity). As shown in FIG. 2, the message bits 2 arrive at the basestation at a later time known as an “Arrival of Message” time instant.The time period between the Start of Opportunity time instant and theArrival of Message time is known as a “T_(twoway)” period of the randomaccess burst. The base station can calculate a round-trip delay becausethe T_(twoway) period's time duration is equal to the round-trip delay'stime duration. The time period it takes for a burst to transmit betweenthe base station and a subscriber unit is known as the “T_(oneway)”period of the random access burst. The T_(oneway) period is exactlyone-half of the T_(twoway) period. The message bits 2 transmissionterminate at a time known as an “End of Message” time instant. The timeperiod between the End of Message time and the End of Opportunity timeinstant is known as an “Unused Time” period because no information isreceived during this time period.

The g time period (FIG. 1) is equal to the sum of the Unused Time periodand the T_(twoway) time period. The Unused Time period is required inorder to accommodate the possibility of a maximum round trip delay. Onlysubscriber units that are at a maximum distance away from the basestation have Unused Time periods of zero microseconds. As mostsubscriber units are within the maximum distance from the base station,Unused Time periods are typically greater than zero microseconds.

In accordance with the RAB method, only one subscriber unit cansynchronize with the base station's time reference during a timeopportunity. FIG. 3 shows an exemplary Uplink Sub-frame Map of theRandom Access Burst method. As shown in FIG. 3, the RAB method schedulestiming opportunities (R) 8 at separate and distinct time frames. Theexemplary Uplink Sub-frame Map of FIG. 3 comprises 51 time framesconsecutively numbered from 0 to 50. As described above with referenceto FIG. 1, each timing opportunity 8 must be sufficient in duration toaccommodate subscriber units that are at the maximum range of the basestation.

Disadvantageously, the RAB method inefficiently allocates bandwidthbecause a base station desiring to receive x subscriber units that havenot resolved their Tx time advance, where x is an integer, must allocateat least x(m+g) total time to minimize burst collisions. Burstcollisions may occur because timing opportunities are typically directedto more than one subscriber unit. For example, a base station desiringto receive 5 subscriber units must allocate at least 5(m+g) total timeto minimize burst collisions. As shown in FIG. 2, subscriber units thatare within the maximum distance from the base station have an UnusedTime period greater than zero microseconds. The Unused Time perioddecreases the overall bandwidth of a communication system because duringthis unused time period data is neither transmitted nor received.Therefore, bandwidth allocation using the RAB method is inefficient andthe RAB method therefore disadvantageously suffers from a decrease inoverall bandwidth availability.

Therefore, a need exists for a method and apparatus for efficientlyusing bandwidth for initial communication and synchronization in atime-synchronized communication system. The method and apparatus shoulddecrease the amount of bandwidth that a communication system requiresfor initial synchronization purposes, thereby increasing the overallbandwidth availability. Such method and apparatus should be efficient interms of the amount of bandwidth consumed by the initial synchronizationmessage that is exchanged between the plurality of subscriber units andtheir associated base stations. The present invention provides such aninitial communication and synchronization method and apparatus.

SUMMARY OF THE INVENTION

The present invention is a method and apparatus for efficiently usingbandwidth for subscriber unit initialization and synchronization in atime-synchronized communication system. The present invention includes apowerful means for efficiently using bandwidth in a time-synchronizedcommunication system. The subscriber unit initialization andsynchronization method and apparatus uses a combination of an accessburst format and a data transportation technique to efficiently usebandwidth in a time-synchronized communication system. Advantageously,the present invention provides a mechanism for a base station to receivemultiple access bursts from multiple subscriber units in a singlecontiguous time period.

In a preferred embodiment of the present invention, bandwidth isefficiently utilized by searching for multiple initial access burstsfrom multiple mobile stations during a single time period known as a newaccess opportunity. The preferred embodiment of the present inventioninitializes and synchronizes in a “contention-based” manner during thesingle time period. The term “contention-based” refers to thepossibility of two or more access bursts (m) arriving at the basestation simultaneously, thus producing a collision. Advantageously, thepresent invention decreases the amount of bandwidth allocated forinitializing mobile stations because the use of the new accessopportunity allows multiple initial access bursts to be received in arelatively short time period. Thus, the amount of bandwidth wasted onunused time periods is reduced.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows the data structure of a random access burst used topractice the Random Access Burst method for providing initialization andsynchronization between a plurality of subscriber units and basestations.

FIG. 2 shows the timing sequence of the random access burst of FIG. 1shown arriving at a timing opportunity in accordance with the RandomAccess Burst method.

FIG. 3 shows an exemplary Uplink Sub-frame Map adapted for use with theRandom Access Burst method.

FIG. 4 shows a block diagram of an exemplary broadband wirelesscommunication system that can be used to practice the present invention.

FIG. 5 a shows a TDD frame and multi-frame structure that can be used bya communication system (such as that shown in FIG. 4) in practicing thepresent invention.

FIG. 5 b shows a FDD frame and multi-frame structure that can be used bya communication system (such as that shown in FIG. 4) in practicing thepresent invention.

FIG. 6 shows one example of a downlink sub-frame that can be used by thebase stations of FIG. 4 to transmit information to a plurality of CPEs.

FIG. 7 shows one example of an uplink sub-frame that can be used topractice the present invention.

FIG. 8 a shows a first exemplary new access opportunity (NAO) inaccordance with the present invention.

FIG. 8 b shows a second exemplary new access opportunity (NAO) inaccordance with the present invention.

FIG. 9 shows an exemplary new access opportunity of the presentinvention beginning at a time n.

Like reference numbers and designations in the various drawings indicatelike elements.

DETAILED DESCRIPTION OF THE INVENTION

Throughout this description, the preferred embodiment and examples shownshould be considered as exemplars, rather than as limitations on thepresent invention.

The preferred embodiment of the present invention is a method andapparatus for efficiently using bandwidth for access and ranging in atime-synchronized communication system. The present inventionefficiently utilizes bandwidth by searching for multiple initial accessbursts from multiple mobile stations during a single time period knownas a new access opportunity. Therefore, a base station can receiveinitial access bursts from multiple mobile stations during onecontiguous time period of an uplink sub-frame map. Advantageously, thepresent invention decreases the amount of bandwidth required forinitializing subscriber stations because the use of one contiguous timeperiod allows multiple initial access bursts to be received in arelatively short time period. Thus, Wasted bandwidth due to unused timeperiods (i.e., periods where data is neither received nor transmitted)is reduced. An exemplary time-synchronized communication system for usewith the present access and ranging invention is now described.

Overview of Time-Synchronized Communication System for Use with thePresent Access and Ranging Invention

An exemplary broadband wireless communication system for use with thepresent invention is described in the commonly assigned U.S. Pat. No.6,016,311, and is shown in the block diagram of FIG. 4. The exemplarybroadband wireless communication system facilitates two-waycommunication between a plurality of base stations and a plurality offixed subscriber stations or Customer Premises Equipment (CPE). As shownin FIG. 4, the exemplary broadband wireless communication system 100includes a plurality of cells 102. Each cell 102 contains an associatedcell site 104 that primarily includes a base station 106 and an activeantenna array 108. Each cell 102 provides wireless connectivity betweenthe cell's base station 106 and a plurality of customer premisesequipment (CPE) 110 positioned at fixed customer sites 112 throughoutthe coverage area of the cell 102. The users of the system 100 mayinclude both residential and business customers. Consequently, the usersof the system have different and varying usage and bandwidth requirementneeds. Each cell may service several hundred or more residential andbusiness CPEs.

The broadband wireless communication system 100 of FIG. 4 provides true“bandwidth-on-demand” to the plurality of CPEs 110. CPEs 110 requestbandwidth allocations from their respective base stations 106 based uponthe type and quality of services requested by the customers served bythe CPEs. Different broadband services have different bandwidth andlatency requirements. The type and quality of services available to thecustomers are variable and selectable. The amount of bandwidth dedicatedto a given service is determined by the information rate and the qualityof service required by that service (the bandwidth allocation alsoaccounts for bandwidth availability and other system parameters). Forexample, T1-type continuous data services typically require a great dealof bandwidth having well-controlled delivery latency. Until terminated,these services require constant bandwidth allocation for each frame. Incontrast, certain types of data services such as Internet protocol dataservices (TCP/IP) are bursty, often idle (which at any one instant mayrequire zero bandwidth), and are relatively insensitive to delayvariations when active.

The base station media access control (“MAC”) is responsible forallocating available bandwidth on a physical channel on the uplink andthe downlink. Within the uplink and downlink sub-frames, the basestation MAC allocates the available bandwidth between the variousservices depending upon the priorities and rules imposed by theirquality of service (“QoS”). The MAC determines when subscribers areallowed to transmit on the physical medium. In addition, if contentionsare permitted, the MAC controls the contention process and resolves anycollisions that may occur. The MAC transports data between a MAC “layer”(information higher layers such as TCP/IP) and a “physical layer”(information on the physical channel).

Due to the wide variety of CPE service requirements, and due to thelarge number of CPEs serviced by any one base station, the bandwidthallocation process in a broadband wireless communication system such asthat shown in FIG. 4 can become burdensome and complex. This isespecially true with regard to rapidly transporting data whilemaintaining synchronization between the MAC and physical communicationprotocol layers. Base stations transport many different data types(e.g., T1 and TCP/IP) between the MAC and physical layers through theuse of data protocols. One objective of a communication protocol is toefficiently transport data between the MAC and physical layers. Acommunication protocol must balance the need for transmitting data atmaximum bandwidth at any given time against the need for maintainingsynchronization between the MAC and physical layers when the data islost during transportation.

In the system shown in FIG. 4, the MAC is typically executed by softwareprocessed by the base stations 106 (in some embodiments, the softwaremay execute on processors both in the base stations and the CPE). Thebase stations 106 receive requests for transmission rights and grantthese requests within the time available taking into account thepriorities, service types, quality of service and other factorsassociated with the CPEs 110. The services provided by the CPEs 110 varyand include, at one end of the service spectrum, TDM information such asvoice trunks from a PBX. At the other end of the service spectrum, theCPEs may uplink bursty yet delay-tolerant computer data forcommunication with the well-known World Wide Web or Internet.

The base station MAC maps and allocates bandwidth for both the uplinkand downlink communication links. These maps are developed andmaintained by the base station and are referred to as the UplinkSub-frame Maps and Downlink Sub-frame Maps. The MAC must allocatesufficient bandwidth to accommodate the bandwidth requirements imposedby high priority constant bit rate (CBR) services such as T1, E1 andsimilar constant bit rate services. In addition, the MAC must allocatethe remaining system bandwidth across the lower priority services suchas Internet Protocol (IP) data services. The MAC distributes bandwidthamong these lower priority services using various QoS dependenttechniques such as fair-weighted queuing and round-robin queuing.

The downlink of the communication system shown in FIG. 4 operates on apoint-to-multi-point basis (i.e., from the base station 106 to theplurality of CPEs 110). As described in the related commonly assignedU.S. Pat. No. 6,016,311, the central base station 106 includes asectored active antenna array 108 which is capable of simultaneouslytransmitting to several sectors. In one embodiment of the system 100,the active antenna array 108 transmits to six independent sectorssimultaneously. Within a given frequency channel and antenna sector, allstations receive the same transmission. The base station is the onlytransmitter operating in the downlink direction, hence it transmitswithout having to coordinate with other base stations, except for theoverall time-division duplexing that divides time into upstream (uplink)and downstream (downlink) transmission periods. The base stationbroadcasts to all of the CPEs in a sector (and frequency). The CPEsmonitor the addresses in the received messages and retain only thoseaddressed to them.

The CPEs 110 share the uplink on a demand basis that is controlled bythe base station MAC. Depending upon the class of service utilized by aCPE, the base station may issue a selected CPE continuing rights totransmit on the uplink, or the right to transmit may be granted by abase station after receipt of a request from the CPE. In addition toindividually addressed messages, messages may also be sent by the basestation to multicast groups (control messages and video distribution areexamples of multicast applications) as well as broadcast to all CPEs.

Frame Maps—Uplink and Downlink Sub-frame Mappings

In one preferred embodiment of the present invention, the base stations106 maintain sub-frame maps of the bandwidth allocated to the uplink anddownlink communication links. The present inventive method and apparatuscan be used with any communication system where the uplink comprises aTime-Division Multiple Access (TDMA) modulation scheme. For example, afrequency division duplex (or “FDD”) or a time-division duplex (or“TDD”) modulation scheme can be used. As described in more detail in thecommonly assigned and related U.S. Pat. No. 6,016,311, the uplink anddownlink can be multiplexed in a TDD manner. In one embodiment, a frameis defined as comprising N consecutive time periods or time slots (whereN remains constant). In accordance with this “frame-based”-approach, thecommunication system dynamically configures the first N₁ time slots(where N is greater than or equal to N₁) for downlink transmissionsonly. The remaining N₂ time slots are dynamically configured for uplinktransmissions only (where N₂ equals N−N₁). Under this TDD frame-basedscheme, the downlink sub-frame is preferably transmitted first and isprefixed with information that is necessary for frame synchronization.

FIG. 5 a shows a TDD frame and multi-frame structure 200 that can beused by a communication system (such as that shown in FIG. 4) inpracticing the present invention. As shown in FIG. 5 a, the TDD frame200 is subdivided into a plurality of physical slots (PS) 204, 204′. Inthe embodiment shown in FIG. 5 a, the frame is one millisecond induration and includes 800 physical slots. Alternatively, the presentinvention can be used with frames having longer or shorter duration andwith more or fewer PSs. The available bandwidth is allocated by a basestation in units of a certain pre-defined number of PSs. Some form ofdigital encoding, such as the well-known Reed-Solomon encoding method,is performed on the digital information over a pre-defined number of bitunits referred to as information elements (PI). The modulation may varywithin the frame and determines the number of PS (and therefore theamount of time) required to transmit a selected PI.

As described in more detail the in the commonly assigned related U.S.Pat. No. 6,016,311, in one embodiment of the broadband wirelesscommunication system shown in FIG. 4, the TDD framing is adaptive. Thatis, the number of PSs allocated to the downlink versus the uplink variesover time. The present inventive data transportation and synchronizationmethod and apparatus can be used in both adaptive and fixed TDD systemsusing a frame and multi-frame structure similar to that shown in FIG. 5a. As shown in FIG. 5 a, to aid periodic functions, multiple frames 202are grouped into multi-frames 206, and multiple multi-frames 206 aregrouped into hyper-frames 208. In one embodiment, each multi-frame 206comprises two frames 202, and each hyper-frame comprises twenty-twomulti-frames 206. Alternatively, other frame, multi-frame andhyper-frame structures can be used to practice the present invention.For example, in another embodiment of the present invention, eachmulti-frame 206 comprises sixteen frames 202, and each hyper-framecomprises thirty-two multi-frames 206.

FIG. 5 b shows an FDD frame and multi-frame structure 250 that can beused by a communication system (such as that shown in FIG. 4) inpracticing the present invention. As shown in FIG. 5 b, the FDD frame250 comprises a plurality of frames 252 wherein each frame 252preferably comprises an uplink subframe 252 a and a downlink subframe252 b. The FDD frame 250 is preferably subdivided into a plurality ofphysical slots (PS) 204, 204′. In the embodiment shown in FIG. 5 b, theframe is one millisecond in duration and includes 800 physical slots persubframe. Alternatively, the present invention can be used with frameshaving longer or shorter duration and with more or fewer PSs. Theavailable bandwidth is allocated by a base station in units of a certainpre-defined number of PSs. Some form of digital encoding, such as thewell-known Reed-Solomon encoding method, is performed on the digitalinformation over a pre-defined number of bit units referred to asinformation elements (PI). The modulation may vary within the frame anddetermines the number of PS (and therefore the amount of time) requiredto transmit a selected PI.

As shown in FIG. 5 b, to aid periodic functions, multiple frames 252 aregrouped into multi-frames 256, and multiple multi-frames 256 are groupedinto hyper-frames 258. In one embodiment, each multi-frame 256 comprisestwo frames 252, and each hyper-frame comprises twenty-two multi-frames256. Alternatively, other frame, multi-frame and hyper-frame structurescan be used to practice the present invention. For example, in anotherembodiment of the present invention, each multi-frame 256 comprisessixteen frames 252, and each hyper-frame comprises thirty-twomulti-frames 256. Exemplary downlink and uplink sub-frames used inpracticing the present invention are shown respectively in FIGS. 6 and7.

Downlink Sub-Frame Map

FIG. 6 shows one example of a downlink sub-frame 300 that can be used bythe base stations 106 to transmit information to the plurality of CPEs110. The base station preferably maintains a downlink sub-frame map thatreflects the downlink bandwidth allocation. The downlink sub-frame 300preferably comprises a frame control header 302, a plurality of downlinkdata PSs 304 grouped by modulation type (e.g., PS 304 data modulatedusing a QAM-4 modulation scheme, PS 304′ data modulated using QAM-16,etc.) and possibly separated by associated modulation transition gaps(MTGs) 306 used to separate differently modulated data, and atransmit/receive transition gap 308. As those skilled in the wirelesscommunications art shall appreciate, the transmit/receive transition gap308 is utilized in TDD systems only (i.e., it is not used in FDDsystems). In any selected downlink sub-frame any one or more of thedifferently modulated data blocks may be absent. In one embodiment,modulation transition gaps (MTGs) 306 are 0 PS in duration; As shown inFIG. 6, the frame control header 302 contains a preamble 310 that isused by the physical protocol layer (or PHY) for synchronization andequalization purposes. The frame control header 302 also includescontrol sections for both the PHY (312) and the MAC (314).

The downlink data PSs are used for transmitting data and controlmessages to the CPEs 110. This data is preferably encoded (using, forexample, a Reed-Solomon encoding scheme) and transmitted at the currentoperating modulation used by the selected CPE. Data is preferablytransmitted using a pre-defined modulation sequence: such as QAM-4,followed by QAM-16, followed by QAM-64. The modulation transition gaps306 contain preambles and are used to separate the modulations. The PHYControl portion 312 of the frame control header 302 preferably containsa broadcast message indicating the identity of the PS 304 at which themodulation scheme changes. Finally, as shown in FIG. 6, the Tx/Rxtransition gap 308 separates the downlink sub-frame from the uplinksub-frame (TDD systems only).

Uplink Sub-Frame Map

FIG. 7 shows one example of an uplink sub-frame 400 that can be used topractice the present invention. In accordance with the present methodand apparatus, the CPEs 110 (FIG. 4) use the uplink sub-frame 400 totransmit information (including the transmission of bandwidth requests)to their associated base stations 106. As shown in FIG. 7, there arethree main classes of MAC control messages that are transmitted by theCPEs 110 during the uplink frame: (1) those that are transmitted incontention slots reserved for CPE registration (Registration ContentionSlots 402); (2) those that are transmitted in contention slots reservedfor responses to multicast and broadcast polls for bandwidth allocation(Bandwidth Request Contention Slots 404); and those that are transmittedin bandwidth specifically allocated to individual CPEs (CPE ScheduledData Slots 406).

The bandwidth allocated for contention slots (i.e., the contention slots402 and 404) is grouped together and is transmitted using apre-determined modulation scheme. For example, in the embodiment shownin FIG. 7 the contention slots 402 and 404 are transmitted using a QAM-4modulation. The remaining bandwidth is grouped by CPE. During itsscheduled bandwidth, a CPE 110 transmits with a fixed modulation that isdetermined by the effects of environmental factors on transmissionbetween that CPE 110 and its associated base station 106. The uplinksub-frame 400 includes a plurality of CPE transition gaps (CTGs) 408that serve a function that is similar to the modulation transition gaps(MTGs) 306 described above with reference to FIG. 6. That is, the CTGs408 separate the transmissions from the various CPEs 110 during theuplink sub-frame 400. In one embodiment, the CTGs 408 are 2 physicalslots in duration. A transmitting CPE preferably transmits a 1 PSpreamble during the second PS of the CTG 408 thereby allowing the basestation to synchronize to the new CPE 110. A transmit/receive transitiongap 410 is utilized in TDD systems only (i.e., it is not used in FDDsystems). Multiple CPEs 110 may transmit in the registration contentionperiod simultaneously resulting in collisions. When collisions occur thebase station may not respond.

Multiple Initialization and Synchronization within a Single ContiguousTime Window

The present invention efficiently utilizes bandwidth by searching formultiple initial access bursts from multiple mobile stations during asingle contiguous time period known as a “new access opportunity”. Thepreferred embodiment of the present invention initializes andsynchronizes in a “contention-based” manner. The term “contention-based”refers to the possibility of two or more access bursts (m)simultaneously arriving at the base station, thus producing a collision.Advantageously, the present invention decreases the amount of bandwidththat must be allocated for the purpose of initializing the mobilestations using the present inventive method and apparatus, multipleinitial access bursts can be received in a relatively short time periodby taking advantage of the new access opportunities. Thus, the amount ofbandwidth wasted on unused time periods is reduced.

FIG. 8 a shows a first exemplary new access opportunity (NAO) 10 inaccordance with the present invention. As shown in FIG. 8 a, the newaccess opportunity 10 has a duration that is equal to m+g+k; where m isthe access burst duration, g is the maximum round-trip delay duration,and k is a time period greater than or equal to zero microseconds. Theduration of the NAO 10 begins at a time interval known as a “Start ofOpportunity” and ends at a time interval known as an “End ofOpportunity”. In the exemplary embodiment, the Start of Opportunityoccurs at time reference T0 and the End of Opportunity occurs at timereference T28. Subscriber units randomly send access bursts (m) to thebase station for initialization and synchronization purposes. Thus, thebase station can receive access bursts (m) at any time within the NAO10. When a subscriber unit's access burst (m) arrives during the NAO 10,the subscriber unit can initialize and synchronize with the base stationif a collision does not occur.

Collisions occur when two or more access bursts (m) simultaneouslyarrive at the base station. Referring again to FIG. 8 a, access bursts22, 24, 26 and 28 begin arriving at the base station at time referencesT2, T8, T11 and T22, respectively. Access bursts 22, 24, 26 and 28finish arriving at the base station at time references T6, T12, T15 andT26, respectively. Therefore, as shown in FIG. 8 a, the access bursts 24and 26 collide during the time period between time reference T11 andT12. In accordance with the present invention a contention process isimplemented to resolve collisions.

One exemplary contention process for use with the present inventionresolves a collision by rejecting all access bursts that are involved inthe collision. Thus, all subscriber units associated with the rejectedaccess bursts do riot initialize and synchronize with the base stationand must transmit another access burst to the base station in order toinitialize and synchronize with the base station. The exemplarycontention process is not meant to be a limitation to the presentinvention as different contention processes can be used withoutdeparting from the scope or spirit of the present invention. Contentionprocesses are well known, and thus, are not described in more detailherein.

FIG. 8 b shows a second exemplary new access opportunity (NAO) 10′ inaccordance with the present invention. The second exemplary NAO 10′illustrates the multiple initialization and synchronization of CPEswithin a single contiguous time window or NAO 10′ of the presentinvention. As shown in FIG. 8 b, the near access opportunity 10′ has aduration EQUAL to m+g+k; where m is the access burst duration, g is themaximum round-trip delay duration, and k is a time period greater thanor equal to zero microseconds. The duration of the NAO 10′ begins at atime interval known as a “Start of Opportunity” and ends at a timeinterval known as an “End of Opportunity”. In the exemplary embodimentthe Start of Opportunity occurs at time reference T0 and the End ofOpportunity occurs at time reference T28. Subscriber units randomly sendaccess bursts (m) to the base station for initialization andsynchronization purposes. Thus, the base station can receive accessbursts (m) at any time within the NAO 10′. When a subscriber unit'saccess burst (m) arrives during the NAO 10′, the subscriber unit caninitialize and synchronize with the base station.

As shown in FIG. 8 b, access bursts 32, 34, 36 and 38 begin arriving atthe base station at time references T2, T8, T11 and T21, respectively.Access bursts 32, 34, 36 and 38 finish arriving at the base station attime references T6, T11, T14 and T25, respectively. Therefore, as shownin FIG. 8 b, the access bursts 32, 34, 36 and 38 initialize andsynchronize within a single contiguous time window or NAO 10′.

Advantageously, the present invention allows multiple access bursts tobe received by the base station during the new access opportunity 10.Equation 1 shows the maximum number of access bursts that can bereceived by the base station during the NAO 10.Maximum number of access bursts=(m+g+k)/m  (Equation 1)

where m=the access burst duration

-   -   g=the maximum round-trip delay duration    -   k=a time period greater than or equal to zero microseconds

In most wireless communication systems, g will be much greater than m.Thus, when the NAO 10 is at a minimum length (i.e., k equals zero), morethan one access burst (m) can be received by the base station. Thus, thepresent invention advantageously allows multiple access bursts (m) to bereceived by the base station during a single contiguous time period. Inthe preferred embodiment, when k is greater than zero, subscriber unitsrandomize their transmission send time, thus, further reducing theprobability of collisions at any given moment during the NAO 10. Randomtransmission methods are well known in the communication arts, and thus,are not described in more detail herein.

Round-trip delay or Tx time advance is preferably calculated using datacontained in the access burst (m) that is transmitted by subscriberunits to associated base stations. Specifically, m preferably containsthe subscriber unit's “send” time (i.e., time that the subscriber unittransmitted the access burst) and identification data (i.e., data thatuniquely identifies the subscriber unit). In accordance with the presentinvention, the subscriber unit preferably is provided with the maximumround-trip delay time (g) for the system. Subscriber units may use anyof a wide variety of well-known methods to obtain the maximum round-tripdelay time (g). These methods are not described in more detail herein.

FIG. 9 shows an exemplary new access opportunity of the presentinvention beginning at a time n. As shown in FIG. 9, the NAO 10 beginsat time n and ends at time n+m+g+k. The earliest time that a basestation can receive an access burst message during the NAO 10 is time n.The latest time that a base station can receive an access burst messageduring the NAO 10 is time n+k because a message arriving later than timen+k would be only partially received due to the length of the messagei.e., the NAO 10 would end before the arrival of the end of themessage). Between the earliest time (time n) and the latest time (timen+k) that a base station can receive access burst messages, the basestation advantageously can receive multiple access burst (m) messages.

Summary

In summary, the subscriber unit initialization and synchronizationmethod and apparatus of the present invention includes a powerful andhighly efficient means for initializing and synchronizing subscriberunits in a time-synchronized communication system. The presentsubscriber unit initialization and synchronization method and apparatususes a combination of an access burst format and a data transportationtechnique to efficiently use bandwidth for initialization andsynchronization purposes. Advantageously, the present invention providesa mechanism for a base station to receive multiple access bursts frommultiple subscriber units in a single contiguous time period.

A number of embodiments of the present invention have been described.Nevertheless, it will be understood that various modifications may bemade without departing from the spirit and scope of the invention. Forexample, the present inventive method and apparatus can be used in anytype of time-synchronized communication system and its use is notlimited to a wireless communication system. One such example is use ofthe invention in a cable modem communication system. In such acommunication system, cable modem “boxes” replace the subscriber unitsdescribed above. Alternatively, the present invention can be used in asatellite communication system. In such a communication systemsatellites replace the base stations described above. Accordingly, it isto be understood that the invention is not to be limited by the specificillustrated embodiment, but only by the scope of the appended claims.

What is claimed is:
 1. An apparatus, comprising: a base station; a mediaaccess control (MAC) element included in the base station and executedby a processor of the base station and configured to: provide acontiguous new access opportunity time period on a frequency channel;and provide one or more reserved time periods, different from thecontiguous time period, for transmission to and from terminal stationson the frequency channel; and an antenna coupled to the base station andconfigured to receive uplink communications from terminal stations,wherein the contiguous new access opportunity time period has a durationof m+g+k, where m is an access burst duration, g is a maximum round-tripdelay duration, and k is a time period greater than or equal to zero,wherein m, g, and k are real numbers, and wherein if k is greater thanzero, the antenna receives the uplink communications from terminalstations that randomize their transmission send time to reduceprobability of collisions during the contiguous new access opportunitytime period.
 2. The apparatus of claim 1 wherein the antenna is furtherconfigured to: receive a first registration message from a firstunregistered terminal station during a first portion of the contiguousnew access opportunity time period; and receive a second registrationmessage from a second unregistered terminal station during a secondportion of the contiguous new access opportunity time period.
 3. Theapparatus of claim 2 wherein the MAC element is further configured to:detect a collision of the first registration message and the secondregistration message, and reject the first and second registrationmessages that have collided.
 4. The apparatus of claim 1 wherein the MACelement is configured to provide the contiguous new access opportunitytime period in an uplink bandwidth map of the frequency channel.
 5. Amethod, comprising: mapping, by a base station, onto an uplink map of afrequency channel: a contiguous new access opportunity time period; andone or more reserved time periods, different from the contiguous newaccess opportunity time period, for transmission to and from terminalstations; wherein the contiguous new access opportunity time period hasa duration of m+g+k, where m is an access burst duration, g is a maximumround-trip delay duration, and k is a time period greater than or equalto zero, wherein m, g, and k are real numbers, and receiving, by saidbase station and if k is greater than zero, uplink communications fromterminal stations that randomize their transmission send time to reduceprobability of collisions during the contiguous new access opportunitytime period.
 6. The method of claim 5, further comprising: receiving, bythe base station, a first registration message from a first unregisteredterminal station beginning on a first time slot of the contiguous newaccess opportunity time period; and receiving, by the base station, asecond registration message from a second unregistered terminal stationbeginning on a second time slot of the contiguous new access opportunitytime period.
 7. The method of claim 6, further comprising: detecting, bythe base station, a collision of the first registration message and thesecond registration message; and rejecting, by the base station, thefirst and second registration messages that have collided.
 8. The methodof claim 5, further comprising mapping, by the base station, a bandwidthrequest time period onto the uplink map of the frequency channel.
 9. Themethod of claim 8, further comprising: receiving, by the base stationfrom a first registered terminal station, a first bandwidth requestbeginning on a first time frame of the bandwidth request time period;and receiving, by the base station from a second registered terminalstation, a second bandwidth request beginning on a second time frame ofthe bandwidth request time period.
 10. An article of manufacture,comprising: a non-transitory computer-readable medium havingprocessor-executable instructions stored thereon that are executable bya processor of a base station to: map onto an uplink map of a frequencychannel: a contiguous new access opportunity time period; and one ormore reserved time periods, different from the contiguous new accessopportunity time period, for transmission to and from terminal stations;wherein the contiguous new access opportunity time period has a durationof m+g+k, where m is an access burst duration, g is a maximum round-tripdelay duration, and k is a time period greater than or equal to zero,wherein m, g, and k are real numbers, and receive, if k is greater thanzero, uplink communications from terminal stations that randomize theirtransmission send time to reduce probability of collisions during thecontiguous new access opportunity time period.
 11. The article ofmanufacture of claim 10 wherein: a first registration message isreceived by said base station from a first unregistered terminal stationbeginning on a first time slot of the contiguous new access opportunitytime period, a second registration message is received by said basestation from a second unregistered terminal station beginning on asecond time slot of the contiguous new access opportunity time period.12. The article of manufacture of claim 11 wherein the non-transitorycomputer readable medium further includes instructions stored thereonthat are executable by said processor to, if said base station detects acollision of the first registration message and the second registrationmessage, cause said base station to reject the first and secondregistration messages that have collided.
 13. The article of manufactureof claim 11 wherein the non-transitory computer readable medium furtherincludes instructions stored thereon that are executable by saidprocessor to map a bandwidth request time period onto the uplink map ofthe frequency channel.
 14. The article of manufacture of claim 13wherein the non-transitory computer readable medium further includesinstructions stored thereon that are executable by said processor to:process a first bandwidth request, received by the base station from afirst registered terminal station, beginning on a first time frame ofthe bandwidth request time period; and process a second bandwidthrequest, received by the base station from a second registered terminalstation, beginning on a second time frame of the bandwidth request timeperiod.